0.00/0.01	% File    : /export/starexec/sandbox2/benchmark/theBenchmark.p
0.00/0.01	% app-encoded or not : original
0.00/0.01	% Variant    : supatvars_ext
0.00/0.01	% Ordering    : rpo6
0.00/0.01	% Command    : 
0.00/0.01	#!/bin/sh
0.00/0.01	
0.00/0.01	./zipperposition.native ${1:+"$1"} \
0.00/0.01	  -i tptp \
0.00/0.01	  -o tptp \
0.00/0.01	  --timeout "$STAREXEC_WALLCLOCK_LIMIT" \
0.00/0.01	  --mem-limit "$STAREXEC_MAX_MEM" \
0.00/0.01	  --no-avatar \
0.00/0.01	  --ho \
0.00/0.01	  --force-ho \
0.00/0.01	  --no-ho-elim-pred-var \
0.00/0.01	  --ho-general-ext-pos \
0.00/0.01	  --no-ho-unif \
0.00/0.01	  --no-induction \
0.00/0.01	  --no-unif-pattern \
0.00/0.01	  --ord $2  \
0.00/0.01	  --simultaneous-sup false \
0.00/0.01	  --sup-at-vars \
0.00/0.01	  --restrict-hidden-sup-at-vars \
0.00/0.01	  --ho-ext-axiom \
0.00/0.01	  --ho-prim-enum none \
0.00/0.01	  --no-max-vars \
0.00/0.01	  --dont-select-ho-var-lits \
0.00/0.01	  --no-fool
0.00/0.20	% Computer   : n154.star.cs.uiowa.edu
0.00/0.20	% Model      : x86_64 x86_64
0.00/0.20	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.00/0.20	% Memory     : 32218.625MB
0.00/0.20	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.00/0.20	% CPULimit   : 300
0.00/0.20	% DateTime   : Fri Feb  2 17:17:25 CST 2018
0.00/0.22	% done 13 iterations in 0.005s
0.00/0.22	% SZS status Theorem for '/export/starexec/sandbox2/benchmark/theBenchmark.p'
0.00/0.22	% SZS output start Refutation
0.00/0.22	tff(complementSubsetComplementIntersect, axiom,
0.00/0.22	  (complementSubsetComplementIntersect <=>
0.00/0.22	   (![A,X]:
0.00/0.22	      (in(X,powerset(A)) =>
0.00/0.22	       (![Y]:
0.00/0.22	          (in(Y,powerset(A)) =>
0.00/0.22	           subset(setminus(A,X),setminus(A,binintersect(X,Y))))))))).
0.00/0.22	tff('0', plain,
0.00/0.22	    ![X2, X3, X4]:
0.00/0.22	      (~ in(X2, powerset(X3))
0.00/0.22	       | subset(setminus(X3, X2), setminus(X3, binintersect(X2, X4)))
0.00/0.22	       | ~ in(X4, powerset(X3))
0.00/0.22	       | ~ complementSubsetComplementIntersect),
0.00/0.22	    inference('cnf', [status(esa)], [complementSubsetComplementIntersect])).
0.00/0.22	tff(complementInPowersetComplementIntersect, conjecture,
0.00/0.22	  (powersetI1 =>
0.00/0.22	   (complementSubsetComplementIntersect =>
0.00/0.22	    (![A,X]:
0.00/0.22	       (in(X,powerset(A)) =>
0.00/0.22	        (![Y]:
0.00/0.22	           (in(Y,powerset(A)) =>
0.00/0.22	            in(setminus(A,X),powerset(setminus(A,binintersect(X,Y))))))))))).
0.00/0.22	tff(zf_stmt_0, negated_conjecture,
0.00/0.22	  (~
0.00/0.22	    (powersetI1 =>
0.00/0.22	     (complementSubsetComplementIntersect =>
0.00/0.22	      (![A,X]:
0.00/0.22	         (in(X,powerset(A)) =>
0.00/0.22	          (![Y]:
0.00/0.22	             (in(Y,powerset(A)) =>
0.00/0.22	              in(setminus(A,X),powerset(setminus(A,binintersect(X,Y)))))))))))).
0.00/0.22	tff('1', plain, complementSubsetComplementIntersect,
0.00/0.22	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.22	tff('2', plain,
0.00/0.22	    ![X2, X3, X4]:
0.00/0.22	      (~ in(X2, powerset(X3))
0.00/0.22	       | subset(setminus(X3, X2), setminus(X3, binintersect(X2, X4)))
0.00/0.22	       | ~ in(X4, powerset(X3))
0.00/0.22	       | ~ $true),
0.00/0.22	    inference('demod', [status(thm)], ['0', '1'])).
0.00/0.22	tff('3', plain,
0.00/0.22	    ![X2, X3, X4]:
0.00/0.22	      (~ in(X4, powerset(X3))
0.00/0.22	       | subset(setminus(X3, X2), setminus(X3, binintersect(X2, X4)))
0.00/0.22	       | ~ in(X2, powerset(X3))),
0.00/0.22	    inference('simplify', [status(thm)], ['2'])).
0.00/0.22	tff(powersetI1, axiom,
0.00/0.22	  (powersetI1 <=> (![A,B]: (subset(B,A) => in(B,powerset(A)))))).
0.00/0.22	tff('4', plain,
0.00/0.22	    ![X0, X1]: (~ subset(X0, X1) | in(X0, powerset(X1)) | ~ powersetI1),
0.00/0.22	    inference('cnf', [status(esa)], [powersetI1])).
0.00/0.22	tff('5', plain, powersetI1, inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.22	tff('6', plain,
0.00/0.22	    ![X0, X1]: (~ subset(X0, X1) | in(X0, powerset(X1)) | ~ $true),
0.00/0.22	    inference('demod', [status(thm)], ['4', '5'])).
0.00/0.22	tff('7', plain, ![X0, X1]: (in(X0, powerset(X1)) | ~ subset(X0, X1)),
0.00/0.22	    inference('simplify', [status(thm)], ['6'])).
0.00/0.22	tff('8', plain,
0.00/0.22	    ![X0, X1, X2]:
0.00/0.22	      (~ $true
0.00/0.22	       | ~ in(X1, powerset(X2))
0.00/0.22	       | ~ in(X0, powerset(X2))
0.00/0.22	       | in(setminus(X2, X1), powerset(setminus(X2, binintersect(X1, X0))))),
0.00/0.22	    inference('sup-', [status(thm)], ['3', '7'])).
0.00/0.22	tff('9', plain,
0.00/0.22	    ![X0, X1, X2]:
0.00/0.22	      (in(setminus(X2, X1), powerset(setminus(X2, binintersect(X1, X0))))
0.00/0.22	       | ~ in(X0, powerset(X2))
0.00/0.22	       | ~ in(X1, powerset(X2))),
0.00/0.22	    inference('simplify', [status(thm)], ['8'])).
0.00/0.22	tff('10', plain,
0.00/0.22	    ~ in(setminus(sk_A2, sk_X1), 
0.00/0.22	        powerset(setminus(sk_A2, binintersect(sk_X1, sk_Y1)))),
0.00/0.22	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.22	tff('11', plain,
0.00/0.22	    (~ $true | ~ in(sk_X1, powerset(sk_A2)) | ~ in(sk_Y1, powerset(sk_A2))),
0.00/0.22	    inference('sup-', [status(thm)], ['9', '10'])).
0.00/0.22	tff('12', plain, in(sk_X1, powerset(sk_A2)),
0.00/0.22	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.22	tff('13', plain, in(sk_Y1, powerset(sk_A2)),
0.00/0.22	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.22	tff('14', plain, (~ $true | ~ $true | ~ $true),
0.00/0.22	    inference('demod', [status(thm)], ['11', '12', '13'])).
0.00/0.22	tff('15', plain, $false, inference('simplify', [status(thm)], ['14'])).
0.00/0.22	
0.00/0.22	% SZS output end Refutation
0.00/0.22	EOF
